import java.util.Stack;

/**
 * Created with Intellij IDEA.
 * Description:
 * User: 28318
 * Date: 2025-11-10
 * Time: 20:08
 */
public class Test {

    public static void main(String[] args) {
        MyCircularQueue mcq = new MyCircularQueue(3);
        mcq.enQueue(1);
        mcq.enQueue(2);
        mcq.enQueue(3);
        mcq.enQueue(4);
    }

    public static void main1(String[] args) {
        MyStackList sta = new MyStackList();
        String[] str = new String[]{
                "2",
                "1",
                "+",
                "3",
                "*",
        };
        System.out.println(sta.evalRPN(str));
    }

    public static void main0(String[] args) {
        MyStackList sta = new MyStackList();
        sta.push(2);
        sta.push(0);
        sta.push(3);
        sta.push(0);
        System.out.println(sta.getMin());
        sta.pop();
        System.out.println(sta.getMin());
        sta.pop();
        System.out.println(sta.getMin());
        sta.pop();
        System.out.println(sta.getMin());
    }

    public boolean IsPopOrder (int[] pushV, int[] popV) {
        Stack<Integer> sta = new Stack<>();
        int j = 0;
        for (int i = 0; i < pushV.length; i++) {
            sta.push(pushV[i]);
            while (!sta.empty() && j < popV.length && sta.peek() == popV[j]){
                sta.pop();
                j++;
            }
        }
        return sta.empty();
    }
}
